SwePub
Tyck till om SwePub Sök här!
Sök i LIBRIS databas

  Extended search

swepub
 

Search: swepub > Broxvall Mathias > Karlsson Lars 1968 > Towards configurati...

  • 1 of 1
  • Previous record
  • Next record
  •    To hitlist

Towards configuration planning with partially ordered preferences : representation and results

d. C. Silva-Lopez, Lia Susana, 1985- (author)
Örebro universitet,Institutionen för naturvetenskap och teknik,AASS
Broxvall, Mathias, 1976- (author)
Örebro universitet,Institutionen för naturvetenskap och teknik,AASS
Loutfi, Amy, 1978- (author)
Örebro universitet,Institutionen för naturvetenskap och teknik,AASS
show more...
Karlsson, Lars, 1968- (author)
Örebro universitet,Institutionen för naturvetenskap och teknik,AASS
show less...
 (creator_code:org_t)
2015-03-29
2015
English.
In: Künstliche Intelligenz. - : Springer Berlin/Heidelberg. - 0933-1875 .- 1610-1987. ; 9:2, s. 173-183
  • Journal article (peer-reviewed)
Abstract Subject headings
Close  
  • Configuration planning for a distributed robotic system is the problem of how to configure the system over time in order to achieve some causal and/or information goals. A configuration plan specifies what components (sensor, actuator and computational devices), should be active at different times and how they should exchange information. However, not all plans that solve a given problem need to be equally good, and for that purpose it may be important to take preferences into account. In this paper we present an algorithm for configuration planning that incorporates general partially ordered preferences. The planner supports multiple preference categories, and hence it solves a multiple-objective optimization problem: for a given problem, it finds all possible valid, non-dominated configuration plans. The planner has been able to successfully cope with partial ordering relations between quantitative preferences in practically acceptable times, as shown in the empirical results. Preferences here are represented as c-semirings, and are used for establishing dominance of a solution over another in order to obtain a set of configuration plans that will constitute the solution of a configuration planning problem with partially ordered preferences. The dominance operators tested in this paper are Pareto and Lorenz dominance. Our solver considers one guiding heuristic for obtaining the first solution, and then switches to a dominance based monotonically decreasing heuristic used for pruning dominated partial configuration plans. In our empirical results, we perform a statistical study in the space of problem instances and establish families of problems for which our approach is computationally feasible.

Subject headings

NATURVETENSKAP  -- Data- och informationsvetenskap -- Datavetenskap (hsv//swe)
NATURAL SCIENCES  -- Computer and Information Sciences -- Computer Sciences (hsv//eng)

Keyword

configuration
planning
sensor network
Computer Science
Datavetenskap

Publication and Content Type

ref (subject category)
art (subject category)

Find in a library

To the university's database

  • 1 of 1
  • Previous record
  • Next record
  •    To hitlist

Search outside SwePub

Kungliga biblioteket hanterar dina personuppgifter i enlighet med EU:s dataskyddsförordning (2018), GDPR. Läs mer om hur det funkar här.
Så här hanterar KB dina uppgifter vid användning av denna tjänst.

 
pil uppåt Close

Copy and save the link in order to return to this view